Larger than Life

نویسندگان

چکیده

In Oona Libens’s poetic-scientific theatre of objects, nonhuman actors take center stage in a universe that hangs together with wires and projection apparatuses. Her playful lecture performances resonate ideas from contemporary ecocritical new materialist debates.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Larger than Life: Humans' Nonverbal Status Cues Alter Perceived Size

BACKGROUND Social dominance and physical size are closely linked. Nonverbal dominance displays in many non-human species are known to increase the displayer's apparent size. Humans also employ a variety of nonverbal cues that increase apparent status, but it is not yet known whether these cues function via a similar mechanism: by increasing the displayer's apparent size. METHODOLOGY/PRINCIPAL...

متن کامل

RealLife: The continuum limit of Larger than Life cellular automata

Let A := {0, 1}. A cellular automaton (CA) is a shift-commuting transformation of AZD determined by a local rule. Likewise, a Euclidean automaton (EA) is a shiftcommuting transformation of ARD determined by a local rule. Larger than Life (LtL) CA are long-range generalizations of J.H. Conway’s Game of Life CA, proposed by K.M. Evans. We prove a conjecture of Evans: as their radius grows to infi...

متن کامل

Is an ant larger than a lion?

In order to examine the influence exerted by an irrelevant semantic variable in a comparative judgment task, we employed a Stroop-like paradigm. The stimuli were pairs of animal names that were different in their physical and semantic sizes (e.g., ant lion). Participants were asked to judge which of the two words was larger either in physical or in semantic size. Size congruity effect (i.e., fa...

متن کامل

Computing Requires Larger Formulas than Approximating

A de Morgan formula over Boolean variables x1, . . . , xn is a binary tree whose internal nodes are marked with AND or OR gates and whose leaves are marked with variables or their negation. We define the size of the formula as the number of leaves in it. Proving that some explicit function (in P or NP) requires large formula is a central open question in computational complexity. While we belie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TDR

سال: 2022

ISSN: ['1054-2043', '1531-4715']

DOI: https://doi.org/10.1017/s1054204322000326